A generalization of ACP using Belnap's logic
نویسندگان
چکیده
ACP is combined with Belnap’s four-valued logic via conditional composition (if–then–else). We show that the operators of ACP can be seen as instances of more general, conditional operators. For example, both the choice operator + and δ (deadlock) can be seen as instances of conditional composition, and the axiom x + δ = x follows from this perspective. Parallel composition is generalized to the binary conditional merge φ‖ψ where φ covers the choice between interleaving and synchronization, and ψ determines the order of execution. The instance B‖B is ACP’s parallel composition, where B (both) is the truth value that models both true and false in Belnap’s logic. Other instances of this conditional merge are sequential composition, pure interleaving and synchronous merge. We investigate the expression of scheduling strategies in the conditions of the conditional merge. © 2006 Elsevier Inc. All rights reserved.
منابع مشابه
Combining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...
متن کاملCombining Explicit Negation and Negation by Failure Via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation. This allows two diierent forms of reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued logic, and a...
متن کاملCut - free Display Calculi for Nominal Tense
We deene cut-free display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use a translation of MNTL into the minimal tense logic of inequality (MTL6 =) which is known to be properly displayable by application of Kracht's results. The rules of the display calculus MNTL for MNTL mimic those of the display calculus MTL...
متن کاملBelnap's Epistemic States and Negation-as-Failure
Generalizing Belnap's system of epistemic states [Bel77] we obtain the system of disjunctive factbases which is the paradigm for all other kinds of disjunctive knowledge bases. Disjunctive factbases capture the nonmonotonic reasoning based on paraminimal models. In the schema of a disjunctive factbase, certain predicates of the resp. domain are declared to be exact, i.e. two-valued, and in turn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 162 شماره
صفحات -
تاریخ انتشار 2006